Characterizing and Computing Minimal Cograph Completions
نویسندگان
چکیده
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is a vertex incremental algorithm to compute a minimal cograph completion H of an arbitrary input graph G in O(|V (H)| + |E(H)|) time.
منابع مشابه
Reports in Informatics Characterizing and Computing Minimal Cograph Completions Characterizing and Computing Minimal Cograph Completions *
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is ...
متن کاملComputing and extracting minimal cograph completions in linear time ∗
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we characterize minimal cograph completions, and we give the following linear-time algorithms: one for extracting a minimal cograph completion from any given cograph completion of G, and one for d...
متن کاملSingle-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions
We study graph properties that admit an increasing, or equivalently decreasing, sequence of graphs on the same vertex set such that for any two consecutive graphs in the sequence their difference is a single edge. This is useful for characterizing and computing minimal completions and deletions of arbitrary graphs into having these properties. We prove that threshold graphs and chain graphs adm...
متن کاملEecient Type Inference for Higher-order Binding-time Analysis
Binding-time analysis determines when variables and expressions in a program can be bound to their values, distinguishing between early (compile-time) and late (run-time) binding. Binding-time information can be used by compilers to produce more eecient target programs by partially evaluating programs at compile-time. Binding-time analysis has been formulated in abstract interpretation contexts...
متن کاملMinimal Split Completions of Graphs
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a split graph, called a split completion of the input graph. Our purpose is to add an inclusion minimal set of edges to obtain a minimal split completion, which means that no proper subset of the added edges is sufficient to create a split completion. Minimal completions of arbitrary graphs into chord...
متن کامل